منابع مشابه
Read-Write Reductions
The discovery, more than a decade ago, of the relation between DistributedComputing (DC) and Algebraic-Topology (AT) raised the specter of requiring checking task solvability to be intimately connected to expertise in AT. Yet, in the area of Centralized Algorithms proving a problem to be NP or PSPACE complete requires more algorithmic expertise than complexity one. In analogy, we show that in D...
متن کاملWeak Read/Write Registers
In [14], Lamport has defined three classes of shared registers which support read and write operations, called —safe, regular and atomic—depending on their properties when several reads and/or writes are executed concurrently. We consider generalizations of Lamport’s notions, called k-safe, k-regular and k-atomic. First, we provide constructions for implementing 1-atomic registers (the stronges...
متن کاملLinearizable Read/Write Objects
We study the cost of using message passing to implement linearizable read write objects for shared memory multiprocessors under various assumptions on the available timing informa tion We take as cost measures the worst case response times for performing read and write operations in distributed implementations of virtual shared memory consisting of such objects and the sum of these response tim...
متن کاملA Sub-threshold 9T SRAM Cell with High Write and Read ability with Bit Interleaving Capability
This paper proposes a new sub-threshold low power 9T static random-access memory (SRAM) cell compatible with bit interleaving structure in which the effective sizing adjustment of access transistors in write mode is provided by isolating writing and reading paths. In the proposed cell, we consider a weak inverter to make better write mode operation. Moreover applying boosted word line feature ...
متن کاملFast Mutual Exclusion Algorithms Using Read-Modify-Write and Atomic Read/Write Registers
Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last algorithm is shown to be optimal in minimizing the number of remote memory accesses required in a resource busy period. Remote memory access is the key factor of memory access bottleneck in large shared-memory multiprocess...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Teaching & Learning Inquiry: The ISSOTL Journal
سال: 2016
ISSN: 2167-4787
DOI: 10.20343/teachlearninqu.4.2.14